Copeland Method Ii: Manipulation, Monotonicity, and Paradoxes
نویسندگان
چکیده
An important issue for economics and the decision sciences is to understand why allocation and decision procedures are plagued by manipulative and paradoxical behavior once there are n ≥ 3 alternatives. Valuable insight is obtained by exploiting the relative simplicity of the widely used Copeland method (CM). By use of a geometric approach, we characterize all CM manipulation, monotonicity, consistency, and involvement properties while identifying which profiles are susceptible to these difficulties. For instance, we show for n = 3 candidates that the CM reduces the negative aspects of the Gibbard-Satterthwaite theorem. This paper continues our investigation into the properties and flaws of the widely used Copeland’s method (CM). Interest in CM derives from its relationship to the Condorcet winner [Cn]; this is a candidate who always is preferred by a majority of the voters when compared with any other alternative. The CM winner [C] is a natural choice when a Condorcet winner does not exist. Namely, award the winning and losing alternative from each pairwise contest, respectively, one and zero points; with a tie, each receives half a point. A candidate’s CM score is the sum of assigned points and the scores determine the CM ranking of the candidates. (To simplify proofs, we use the equivalent weights (1, 0, −1).) In spite of its wide use (e.g., the CM is commonly used to rank sports teams), surprisingly little is known about it. Our first paper [SM] examines single profile CM properties by contrasting the CM rankings with those of positional procedures, by describing how the CM rankings vary as candidates enter or drop out of the election, and by comparing the “natural” and CM rankings associated with certain profiles. (Recall; a profile is a listing of the voters’ preferences.) This paper addresses multiple profile issues. As examples, if profile p1 represents the current, sincere preferences of the voters, another profile p2 might be where some voters now vote for the p1-CM winner, or they vote strategically to try to alter the outcome, or they forget to vote. The goal is to understand how the p1, p2 CM outcomes are related. Thus, multiple profile issues include not only strategic voting, but also those traditional normative themes which
منابع مشابه
The likelihood of monotonicity paradoxes in run-off elections
A monotonicity paradox occurs when a voting system reacts in a perverse way to a change in individual opinions. The vulnerability of a voting system to monotonicity paradoxes is defined as the proportion of voting situations that can give rise to such paradoxes. In this paper we provide analytical representations of this vulnerability in the three-alternative case for two voting systems, i.e. p...
متن کاملHybrid Hamilton-Webster and the Greek apportionment
The method of largest remainders (Hamilton) is used for allotment of 288 of the seats among the 56 Greek constituencies. This method possesses various paradoxes as was observed through two centuries of application. So we propose a modification where the seats are allocated at a first stage by the lower Hare-Quota and the additional ones using the method of major fractions (Webster) restricted s...
متن کاملCopeland voting: ties matter
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter α that describes how ties in head-to-head contests are valued. We show that the thus obtained problem of manipulation for unweighted Copeland elections is NP-complete even if the size of the manipulating coalition is limited to two. Our result holds for all rational ...
متن کاملManipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland-manipulation for α ∈ {0, 1}. Copeland, 0 ≤ α ≤ 1, is an election system where for each pair of candidates we check which one is preferred by more voters (i.e., we conduct a head-to-head majority contest) and we give one point to this candidate and zero to the other. How...
متن کاملManipulation with Bounded Single-Peaked Width: A Parameterized Study
We study the manipulation problem in elections with bounded singlepeaked width from the parameterized complexity point of view. In particular, we focus on the Borda, Copeland and Maximin voting correspondences. For Borda, we prove that the unweighted manipulation problem with two manipulators is fixed-parameter tractable with respect to single-peaked width. For Maximin and Copeland for every 0 ...
متن کامل